Finding Tacit Knowledge by Solving the Pre-Requirements Tracing Problem
نویسندگان
چکیده
Tacit knowledge prevents requirements engineers from completely identifying system constraints. Users may be unaware of the need to articulate this knowledge or even be aware they posses it. Therefore external methods of tacit knowledge identification are required. In this position paper we present a proposed method of tacit knowledge identification by solving pre-requirements specification tracing using statistical natural language processing techniques.
منابع مشابه
Using pre-requirements tracing to investigate requirements based on tactic knowledge
Pre-requirements specification tracing concerns the identification and maintenance of relationships between requirements and the knowledge and information used by analysts to inform the requirements’ formulation. However, such tracing is often not performed as it is a time-consuming process. This paper presents a tool for retrospectively identifying pre-requirements traces by working backwards ...
متن کاملExperience Management in Maintenance and After Sale Service of an Industrial Enterprise
Back ground and Aim: Experience Management and Tacit Knowledge of organization's employees are considered one of the most important capitals of today's leading companies. This study is done in a company which produces manufacturing bending machine for tube and wire. The quality of after-sales service and the performance of the technicians' regarding to the customers are important in this compan...
متن کاملTacit Knowledge in Requirements
The importance of tacit knowledge in requirements elicitation and understanding is widely accepted but poorly understood. There is no clear definition of tacit knowledge, with definitions spanning knowledge that cannot be articulated to knowledge that is merely unarticulated. The situation is further confused by the fact that the most widely cited author on tacit knowledge (Michael Polanyi) act...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملEnhancing University Research Activities with Knowledge Management
In the new economy, innovation is regarded as one of the solutions for almost every organisation to survive in the new business era. Universities, especially in terms of research activities, are no difference since they strive for novelties which potentially lead to innovation. An experienced researcher in the university has continually created tacit knowledge in a specific domain, but typicall...
متن کامل